منابع مشابه
FURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES
Convergence is an issue being widely concerned about. Thus, in this paper, we mainly put forward two types of concepts of convergence in mean and convergence in distribution for the sequence of uncertain random variables. Then some of theorems are proved to show the relations among the three convergence concepts that are convergence in mean, convergence in measure and convergence in distributio...
متن کاملGambling in Contests with Random Initial Law
Copyright and reuse: The Warwick Research Archive Portal (WRAP) makes this work of researchers of the University of Warwick available open access under the following conditions. Copyright © and all moral rights to the version of the paper presented here belong to the individual author(s) and/or other copyright owners. To the extent reasonable and practicable the material made available in WRAP ...
متن کاملNonrandom Sequences between Random Sequences
Let us say that an infinite binary sequence q lies above an infinite binary sequence p if q can be obtained from p by replacing selected 0’s in p by 1’s. We show that above any infinite binary Martin-Löf random sequence p there exists an infinite binary nonrandom sequence q above which there exists an infinite binary random sequence r. This result is of interest especially in connection with th...
متن کاملA savings paradox for integer-valued gambling strategies
Under the assumption that wagers remain integer-valued, as would happen in most casinos, we identify the following bizarre situation: there exists a sequence of coin flips X such that some effective gambler manages to accumulate arbitrary wealth by betting on X, however any such gambler goes bankrupt whenever he tries to take his winnings outside the casino.
متن کاملBinary Random Sequences Obtained From Decimal Sequences
D sequences [1-15] are perhaps the simplest family of random sequences that subsumes other families such as shift register sequences [16]. In their ordinary form, d sequences are not computationally complex [2], but they can be used in a recursive form [8] that is much stronger from a complexity point of view. The basic method of the generating the binary d-sequences is given in [1]. The autoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie
سال: 2010
ISSN: 2222-4173,0254-3486
DOI: 10.4102/satnt.v29i1.3